Integration of Bounded Model Checking and Deductive Verification
نویسندگان
چکیده
Modular deductive veri cation of software systems is a complex task: the user has to put a lot of e ort in writing module speci cations that t together when verifying the system as a whole. In this paper, we propose a combination of deductive veri cation and software bounded model checking (SBMC), where SBMC is used to support the user in the speci cation and veri cation process, while deductive veri cation provides the nal correctness proof. SMBC provides early as well as precise feedback to the user. Unlike modular deductive veri cation, the SBMC approach is able to check annotations beyond the boundaries of a single module even if other relevant modules are not annotated (yet). This allows to test whether the di erent module speci cations in the system match the implementation at every step of the speci cation
منابع مشابه
Safety Verification and Refutation by k-invariants and k-induction (extended version)
Most software verification tools can be classified into one of a number of established families, each of which has their own focus and strengths. For example, concrete counterexample generation in model checking, invariant inference in abstract interpretation and completeness via annotation for deductive verification. This creates a significant and fundamental usability problem as users may hav...
متن کاملAutomated Verification for Functional and Relational Properties of Voting Rules
In this paper, we formalise classes of axiomatic properties for voting rules, discuss their characteristics, and show how symmetry properties can be exploited in the verification of other properties. Following that, we describe how automated verification methods such as software bounded model checking and deductive verification can be used to verify implementations of voting rules. We present a...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملIncremental Bounded Model Checking for Embedded Software (extended version)
Program analysis is on the brink of mainstream in embedded systems development. Formal verification of behavioural requirements, finding runtime errors and automated test case generation are some of the most common applications of automated verification tools based on Bounded Model Checking. Existing industrial tools for embedded software use an off-the-shelf Bounded Model Checker and apply it ...
متن کاملEfficient Saturation-based Bounded Model Checking of Asynchronous Systems
Formal verification is becoming a fundamental step in assuring the correctness of safety-critical systems. However, due to these systems being often asynchronous and even distributed, their behaviour can be very complex. Thus, their verification necessitates methods that can deal with huge or even infinite state spaces. In this paper we present how the integration of two advanced algorithms for...
متن کامل